-
1 Boolean addition
булево сложение; логическое сложение -
2 Boolean addition
булево [логическое] сложениеБольшой англо-русский и русско-английский словарь > Boolean addition
-
3 Boolean addition
Англо-русский словарь технических терминов > Boolean addition
-
4 Boolean addition
Техника: булево сложение, логическое сложение -
5 Boolean addition
булево [логическое] сложениеEnglish-Russian dictionary of computer science and programming > Boolean addition
-
6 Boolean addition
булево сложение; логическое сложение -
7 Boolean
1. булев2. логическийBoolean addition — булево сложение; логическое сложение
Boolean operation — булева операция; логическая операция
Boolean expression — булево выражение, логическое выражение
-
8 boolean
Boolean variable — булева переменная; логическая переменная
Boolean expression — булево выражение, логическое выражение
Boolean operation — булева операция; логическая операция
Boolean addition — булево сложение; логическое сложение
-
9 Boolean
Boolean variable — булева переменная; логическая переменная
Boolean expression — булево выражение, логическое выражение
Boolean operation — булева операция; логическая операция
Boolean addition — булево сложение; логическое сложение
-
10 addition
1) сложение2) добавка; присадка3) добавление; присоединение•- addition of clay -
addition of sand
-
addition of starter
-
addition of tannin
-
alloy addition
-
binary addition
-
Boolean addition
-
complementary addition
-
decimal addition
-
deoxidizing addition
-
destructive addition
-
finishing addition
-
fixed-point addition
-
floating-point addition
-
freeze-drying addition
-
head-to-head addition
-
head-to-tail addition
-
iterative addition
-
logical addition
-
logic addition
-
modulo N addition
-
molasses addition
-
mold addition
-
nondestructive addition
-
octal addition
-
parallel addition
-
serial addition
-
slag-making addition
-
stereospecific addition
-
term-by-term addition
-
ternary addition
-
vectorial addition
-
vector addition
-
vitamin addition
-
zero access addition -
11 addition
сложение, суммирование; прибавление- accumulative addition
- addition by subtraction
- addition without carry
- binary addition
- bitwise addition
- Boolean addition
- chained addition
- complementary addition
- cyclic addition
- decimal addition
- destructive addition
- direct addition
- iterative addition
- logical addition
- modular additions
- modulo N addition
- N addition
- nondestructive addition
- octal addition
- parallel addition
- serial addition
- term-by-term addition
- ternary addition
- vectorial addition
- vector addition
- zero access additionEnglish-Russian dictionary of computer science and programming > addition
-
12 addition
Boolean addition — булево сложение; логическое сложение
The English-Russian dictionary general scientific > addition
-
13 addition
<tech.gen> (of materials, substances) ■ Zugabe f ; Hinzufügen n<chem.proc> (process; stress on: mixing sth to sth) ■ Beimengung f ; Beimischung f<srfc.wood> (in restoration; part added onto an object or structure) ■ Ergänzung f -
14 abridged addition
Boolean addition — булево сложение; логическое сложение
-
15 accumulative addition
Boolean addition — булево сложение; логическое сложение
-
16 logical addition
Boolean addition — булево сложение; логическое сложение
-
17 octal addition
восьмеричное сложение; сложение в восьмеричной системеBoolean addition — булево сложение; логическое сложение
-
18 parallel addition
Boolean addition — булево сложение; логическое сложение
-
19 ternary addition
троичное сложение; сложение в троичной системеBoolean addition — булево сложение; логическое сложение
-
20 zero access addition
Boolean addition — булево сложение; логическое сложение
См. также в других словарях:
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Boolean logic — is a complete system for logical operations. It was named after George Boole, who first defined an algebraic system of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the… … Wikipedia
Addition — is the mathematical process of putting things together. The plus sign + means that two numbers are added together. For example, in the picture on the right, there are 3 + 2 apples meaning three apples and two other apples which is the same as… … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean ring — In mathematics, a Boolean ring R is a ring (with identity) for which x 2 = x for all x in R ; that is, R consists only of idempotent elements.Boolean rings are automatically commutative and of characteristic 2 (see below for proof). A Boolean… … Wikipedia
Boolean algebra — /booh lee euhn/ 1. Logic. a deductive logical system, usually applied to classes, in which, under the operations of intersection and symmetric difference, classes are treated as algebraic quantities. 2. Math. a ring with a multiplicative identity … Universalium
Boolean datatype — In computer science, the Boolean datatype, sometimes called the logical datatype , is a primitive datatype having one of two values: true and false. Many systems represent true as non zero (often 1, or 1) and false as zero . It is the special… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… … Wikipedia